Permutation Polytopes of Cyclic Groups
نویسندگان
چکیده
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. In the situation that the generator of the group consists of at most two orbits, we can give a complete combinatorial description of the associated permutation polytope. In the case of three orbits the facet structure is already quite complex. For a large class of examples we show that there exist exponentially many facets. Résumé. Nous étudions les propriétés combinatoires et géométriques des polytopes de permutations pour des groupes cycliques. C’est à dire, donné un groupe cyclique de matrices de permutations, nous considérons son enveloppe convexe. Si le générateur du groupe possède un ou deux orbites il y a une déscription simple du polytope. Par contre, le cas de trois (ou plus) orbites est beaucoup plus compliqué. Pour une classe ample d’examples nous construisons un nombre exponentiel de faces de co-dimension un.
منابع مشابه
On Permutation Polytopes - Notions of Equivalence
By assigning a permutation polytope to a group we produce new interesting polytopes. For the effective use of this construction method it is desirable to understand which groups are leading to affine equivalent polytopes. Therefore, the notion of effective equivalence has been introduced [BHNP09]. In this note we clarify the notion of effective equivalence and characterize geometrically the eff...
متن کاملThe remoteness of the permutation code of the group $U_{6n}$
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group $U_{6n}$ as a subgroup of $S_{2n+3}$ and obtain its remoteness. We show that the remoteness of the permutation code $U_{6n}$ is $2n+2$. Moreover, ...
متن کاملEhrhart Polynomials of Lattice-face Polytopes
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any d-dimensional simplex in general position into d! signed sets, each of which corresponds to a permutation in the symmetric group Sd, and reduce the problem of...
متن کاملOn Lattice-Free Orbit Polytopes
Given a permutation group acting on coordinates of R, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called core points and they play a key role in a recent approach to exploit symmetry in integer convex optimization problems. Here, naturally the question arises, for which groups the number of core points is Vni...
متن کاملOn the permutation groups of cyclic codes
We classify the permutation groups of cyclic codes over a finite field. As a special case, we find the permutation groups of non-primitive BCH codes of prime length. In addition, the Sylow p-subgroup of the permutation group is given for many cyclic codes of length p. Several examples are given to illustrate the results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012